Evaluation of Surplus Round Robin Scheduling Algorithm
نویسندگان
چکیده
In multi-service packet networks the packet scheduling algorithm plays a key role in delivering guaranteed service to different flows. In this article we evaluate surplus round robin (SRR) scheduling algorithm. We apply the Latency-Rate (LR) servers theory in order to obtain bounds on the latency and delay provided by the algorithm. We compare the performance characteristics of SRR with the popular deficit round robin (DRR) algorithm to conclude that SRR can provide better performance than DRR.
منابع مشابه
Stability Improvement of Hydraulic Turbine Regulating System Using Round-Robin Scheduling Algorithm
The sustainability of hydraulic turbines was one of the most important issues considered by electrical energy provider experts. Increased electromechanical oscillation damping is one of the key issues in the turbines sustainability. Electromechanical oscillations, if not quickly damp, can threaten the stability of hydraulic turbines and causes the separation of different parts of the netw...
متن کاملDesign and Performance Evaluation of A New Proposed Fittest Job First Dynamic Round Robin(FJFDRR) Scheduling Algorithm
In this paper, we have proposed a new variant of Round Robin scheduling algorithm by executing the processes according to the new calculated Fit Factor ‘f’ and using the concept of dynamic time quantum. We have compared the performance of our proposed Fittest Job First Dynamic Round Robin(FJFDRR) algorithm with the Priority Based Static Round Robin(PBSRR) algorithm. Experimental results show th...
متن کاملComparative performance analysis of multi dynamic time quantum Round Robin(MDTQRR) algorithm with arrival time
CPU being considered a primary computer resource, its scheduling is central to operating-system design. A thorough performance evaluation of various scheduling algorithms manifests that Round Robin Algorithm is considered as optimal in time shared environment because the static time is equally shared among the processes. We have proposed an efficient technique in the process scheduling algorith...
متن کاملFair and Efficient Packet Scheduling Using Elastic Round Robin
ÐParallel systems are increasingly being used in multiuser environments with the interconnection network shared by several users at the same time. Fairness is an intuitively desirable property in the allocation of bandwidth available on a link among traffic flows of different users that share the link. Strict fairness in traffic scheduling can improve the isolation between users, offer a more p...
متن کاملComparisons of Improved Round Robin Algorithms
Many altered versions of the Round Robin CPU scheduling algorithm have been created to fix the shortcomings of the Standard Round Robin algorithm. When these improved Round Robin algorithms are first created, they are always compared to the Standard Round Robin algorithm to ensure that they provide an improvement over it. Occasionally, they are compared to one other improved Round Robin algorit...
متن کامل